#include<bits/stdc++.h>
using namespace std;

const int MAXN = 1e5 + 10;

int n;
map <int , int> mp;
queue<int> q;

int main()
{
    freopen("duel.in" , "r" , stdin);
    freopen("duel.out" , "w" , stdout);
    scanf("%d" , &n);
    for(int i = 1 ; i <= n ; i ++)
    {
        int x;
        scanf("%d" , &x);
        mp[x] ++;
    }

    int now = 0 , ans = n;

    for(auto i : mp)
    {
        now = max(0 , now - i.second);
        now += i.second;
    }
    printf("%d\n" , now);
    return 0;
}